A Note on the Number of $(k,l)$-Sum-Free Sets
نویسندگان
چکیده
منابع مشابه
A Note on the Number of (k, l)-Sum-Free Sets
A set A ⊆ N is (k, `)-sum-free, for k, ` ∈ N, k > `, if it contains no solutions to the equation x1 + · · ·+xk = y1 + · · ·+y`. Let ρ = ρ(k− `) be the smallest natural number not dividing k − `, and let r = rn, 0 ≤ r < ρ, be such that r ≡ n (mod ρ). The main result of this note says that if (k − `)/` is small in terms of ρ, then the number of (k, `)-sum-free subsets of [1, n] is equal to (φ(ρ) ...
متن کاملOn the Number of Maximal Sum-free Sets
It is shown that the set {1, 2, . . . , n} contains at most 2n/2−2n maximal sum-free subsets, provided n is large enough. A set A ⊆ [n] = {1, 2, . . . , n} is sum-free if for any two elements a, b ∈ A we have a + b / ∈ A. A sum-free set A ⊆ [n] is maximal if it is not contained in any other sum-free subset of [n]. Let s(n) and smax(n) denote the number of sum-free and maximal sum-free subsets o...
متن کاملBounds on the Number of Maximal Sum-Free Sets
We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 2. We also show that 2 is an upper bound on the number of maximal product-free subsets of any group of order n.
متن کاملLong arithmetic progressions in sum-sets and the number of x-sum-free sets
In this paper we obtain optimal bounds for the length of the longest arithmetic progression in various kinds of sum-sets. As an application, we derive a sharp estimate for the number of sets A of residues modulo a prime n such that no subsum of A equals x modulo n, where x is a fixed residue modulo n.
متن کاملA sharp bound on the number of maximal sum-free sets
Cameron and Erdős [7] asked whether the number of maximal sum-free sets in {1, . . . , n} is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of 2bn/4c for the number of maximal sum-free sets. We prove the following: For each 1 ≤ i ≤ 4, there is a constant Ci such that, given any n ≡ i mod 4, {1, . . . , n} contains (Ci + o(1))2n/4 maximal sum-free sets. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2000
ISSN: 1077-8926
DOI: 10.37236/1508